Access pattern-based code compression for memory-constrained systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Memory Access Pattern Protection for Resource-Constrained Devices

We propose a practice-oriented scheme for protecting RAM access pattern. We first consider an instance which relies on the use of a secure (trusted) hardware buffer; it achieves both security and performance levels acceptable in practice by adapting ideas from oblivious RAM mechanisms, yet without the expensive (re-)shuffling of buffers. Another instance requires no special hardware, but as a r...

متن کامل

Constellation-constrained capacity for trellis code multiple access systems

Trellis code multiple access (TCMA) is a narrow-band multiple access scheme. There is no bandwidth expansion, so users are using the same bandwidth as one single user. The load (the number of bits per channel use) of the system is therefore much higher than the load in, for example, conventional CDMA systems. It is shown here that the maximum number of users in a TCMA system is usually modest. ...

متن کامل

Image Compression for Memory Constrained Printers

We study memory eecient image compression techniques for color digital printers. Particular constraints imposed by printers are incorporated into the algorithms presented.

متن کامل

Huffman-based code compression techniques for embedded systems

Increasing embedded systems functionality causes a steep increase in code size. For instance, more than 60MB of software is installed in current state-of-the-art cars [9]. It is often challenging and cumbersome to host vast amount of software in an efficient way within a given hardware resource budget of an embedded system. This may be done by using code compression techniques, which compress t...

متن کامل

Access Control Based on Code Identity for Open Distributed Systems

In computing systems, trust is an expectation on the dynamic behavior of an agent; static analysis is a collection of techniques for establishing static bounds on the dynamic behavior of an agent. We study the relationship between code identity, static analysis and trust in open distributed systems. Our primary result is a robust safety theorem expressed in terms of a distributed higher-order p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Design Automation of Electronic Systems

سال: 2008

ISSN: 1084-4309,1557-7309

DOI: 10.1145/1391962.1391968